/*模拟实现顺序表vector*/
#pragma once
#include <iostream>
#include <cassert>
template <class T>
class my_vector
{
public:
    my_vector()
        : _size(0)
        , _data(nullptr)
    {}
    ~my_vector()
    {
        delete _data;
    }
    bool insert(int pos, const T& data)
    {

    }
    int erase(int pos)
    {

    }
    bool push_back()
    {}
    bool push_front()
    {}
    bool pop_back()
    {}
    bool pop_front()
    {

    }
    T& operator[] (int pos)
    {
        assert(pos > 0 && pos < _size);
        return _data[pos];
    }
    int size()
    {
        return _size;
    }
    bool resize()
    {}
    bool resverse()
    {}
    /*迭代器*/
    int begin()
    {
        return 0;
    }
    int end()
    {
        return _size;
    }
private:
    int _size;
    T* _data;
};